Generalizing the arithmatic geometric mean — a hapless computer experiment
نویسندگان
چکیده
منابع مشابه
Generalizing the Arithmetic Geometric Mean
The paper discusses the asymptotic behavior of generalizations of the Gauss’s arithmetic-geometric mean, associated with the names Meissel (1875) and Borchardt (1876). The "hapless computer experiment" in the title refers to the fact that the author at an earlier stage thought that one had genuine asymptotic formulae but it is now shown that in general "fluctuations" are present. However, no ve...
متن کاملGeneralizing Geometric Graphs
Network visualization is essential for understanding the data obtained from huge real-world networks such as flight-networks, the AS-network or social networks. Although we can compute layouts for these networks reasonably fast, even the most recent display media are not capable of displaying these layouts in an adequate way. Moreover, the human viewer may be overwhelmed by the displayed level ...
متن کاملThe geometric mean decomposition
Given a complex matrix H, we consider the decomposition H=QRP∗ where Q and P have orthonormal columns, and R is a real upper triangular matrix with diagonal elements equal to the geometric mean of the positive singular values of H. This decomposition, which we call the geometric mean decomposition, has application to signal processing and to the design of telecommunication networks. The unitary...
متن کاملThe geometric mean algorithm
Bisection (of a real interval) is a well known algorithm to compute eigenvalues of symmetric matrices. Given an initial interval [a, b], convergence to an eigenvalue which has size much smaller than a or b may be made considerably faster if one replaces the usual arithmetic mean (of the end points of the current interval) with the geometric mean. Exploring this idea, we have implemented geometr...
متن کاملThe matrix geometric mean
An attractive candidate for the geometric mean of m positive definite matrices A1, . . . , Am is their Riemannian barycentre G. One of its important properties, monotonicity in the m arguments, has been established recently by J. Lawson and Y. Lim. We give a much simpler proof of this result, and prove some other inequalities. One of these says that, for every unitarily invariant norm, |||G||| ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1989
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s016117128900027x